Description: 是一个有自动求解功能的推箱子游戏，本人的旧作品。使用了从起点和终点两个方向同时进行有向图搜索的方法，是学习博弈算法的极佳参考。闲来玩玩这个游戏可锻炼思维，精选了网上流行的很多高难度地图，如果全部都可不使用AI求解，那就很厉害了。-is an automatic function of viewing solving games, my old works. Use the starting and finishing points from two directions simultaneously directed graph search methods, Game learning algorithm is an excellent reference. Leisure can play this game thinking exercise featured many popular online maps difficult, If all of them could not use AI solution, it would be very familiar. Platform: |
Size: 782336 |
Author:苏朝晖 |
Hits:
Description: 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法 （1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algorithm and C language programming. map of the search path traversal methods to the adjacency matrix and adjacency list of storage connected graph. Then, using the priority traversal algorithm depth of the matrix adjacent to the storage map and the adjacent forms storage plans. Depth-first traversal of the recursive algorithm (1) depth-first traversal algorithm (2) adjoining table depth-first search algorithm ( 3) adjacency matrix of depth-first search algorithm. Platform: |
Size: 1024 |
Author:林静 |
Hits:
Description: kruskal算法，实现图的遍历最短路径查找，本人的算法设计的一次实验。-Kruskal algorithm, to achieve the shortest path graph traversal search, the algorithm I designed an experiment. Platform: |
Size: 231424 |
Author:moxianwen |
Hits:
Description: 用经典的局部搜索算法模拟退火算法求解一个图的最大可平面子图。-With the classic local search algorithm simulated annealing algorithm for solving a graph of maximum planar subgraph. Platform: |
Size: 55296 |
Author:张清国 |
Hits:
Description: 无向图的深度优先搜索算法/c语言实现 其中图采用邻接矩阵存储 -Undirected graph of the depth-first search algorithm/c language in which Fig realize the use of adjacency matrix storage Platform: |
Size: 1024 |
Author:罗军 |
Hits:
Description: 信息学竞赛中常用的算法总结:
串匹配的高效算法-KMP
公开密钥体系之RSA算法
双向广度搜索
图论算法
-Informatics algorithms commonly used race Summary: Efficient String Matching Algorithm-KMP system RSA public key algorithm for bi-directional breadth of the search algorithm of graph theory Platform: |
Size: 106496 |
Author:lll |
Hits:
Description: 本文档容括了C（C＋＋）所有算法，分为数值算法、图论算法、背包算法、排序算法、高精度算法、树的遍历、进制转换、全排列和组合生成、查找算法、贪心、回溯法框架、DFS框架、BFS框架、数据结构相关算法。并有实例源码-This document, including the capacity C (C ) for all algorithms, divided into numerical algorithms, graph theory, algorithm, knapsack algorithm, sorting algorithm, high-precision algorithms, tree traversal, binary conversion, the whole arrangement and combination of generation, search algorithm, greedy , backtracking framework, DFS framework, BFS framework, data structure-correlation algorithm. And examples of source Platform: |
Size: 15360 |
Author:海霞 |
Hits:
Description: 图的算法的基本训练
1、 图的存储结构的定义和图的创建
图的种类有：有向图、无向图、有向网、无向网。
图的存储结构可采用：邻接矩阵、邻接表。
要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法
2、 图的遍历：非递归的深度优先搜索算法、广度优先搜索算法。
3、 图的深度遍历的应用：求无向连通图中的关节点（教材P177-178,算法7.10和7.11）
4、 图的广度遍历的应用：给定图G，输出从顶点v0到其余每个顶点的最短路径，要求输出各路径中的顶点信息。
-Map of the basic training algorithm 1 and the storage structure of the definition and plans to create the types of plans are: directed graph, undirected graph, to the network, no to the network. Map storage structure can be: adjacency matrix, the adjacent table. Requirements: adjacency matrix is given, respectively, and adjacent table in a certain kind of map creation algorithm 2, graph traversal: Non-recursive depth-first search algorithm, breadth-first search algorithm. 3, graph traversal depth of applications: for Undirected connected graph of the key points (teaching P177-178, Algorithm 7.10 and 7.11) 4, Fig traverse the breadth of applications: a given graph G, the output from the vertex v0 to The rest of each vertex of the shortest path, the path of the output requirements of the vertex information. Platform: |
Size: 7168 |
Author:bueaty |
Hits:
Description: 关于野人过河问题中的程序设计，包括用图的广度优先搜索算法-Across the river on the Savage program design issues, including breadth-first graph search algorithm Platform: |
Size: 107520 |
Author:张明 |
Hits:
Description: 采取邻接矩阵的搜索算法实现了对图的着色，是一种数值优化算法-Adjacency matrix to a search algorithm for graph coloring, is a numerical optimization algorithm Platform: |
Size: 207872 |
Author:yangke |
Hits:
Description: Dijkstra s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959, is a graph search algorithm that solves the single-source shortest path Platform: |
Size: 1024 |
Author:jonathan |
Hits:
Description: Abstract. We present an algorithm for finding the minimum cut of an undirected edge-weighted
graph. It is simple in every respect. It has a short and compact description, is easy to implement, and
has a surprisingly simple proof of correctness. Its runtime matches that of the fastest algorithm
known. The runtime analysis is straightforward. In contrast to nearly all approaches so far, the
algorithm uses no flow techniques. Roughly speaking, the algorithm consists of about uVu nearly
identical phases each of which is a maximum adjacency search. Platform: |
Size: 2048 |
Author:Daniel |
Hits:
Description: 用Snake算法和基于动态规划的图搜索算法，有效地实现了复杂物体轮廓特征的提取。 -With the Snake algorithm and based on dynamic programming graph search algorithm, effective implementation of the complex features of an object contour extraction. Platform: |
Size: 882688 |
Author:黄静 |
Hits:
Description: 一个python程序，实现了无向图的结构模拟，以及广度优先搜索的算法，以及显示最短路径之一。用leo+ulipad实现。-A python program to realize the structure of an undirected graph simulation, as well as the breadth-first search algorithm, and display one of the shortest path. By leo+ ulipad achieved. Platform: |
Size: 2048 |
Author:周鹏 |
Hits:
Description: visibility graph code developed on matlab, which uses astar search algorithm and minkowski difference - developed and updated from the previosly uploaded java source code Platform: |
Size: 7168 |
Author:jackass243 |
Hits:
Description: 图搜索的非启发式和启发式算法, 着重分析了它们各自的复杂性、优缺点及
其相互关系, 提出了改进要点. 这对于如何选用一个合适的搜索算法是十分有益的.-Figure of non-heuristic and heuristic search algorithm, analyzes the complexity of their respective advantages and disadvantages and their relationship, an improved points. This is how to choose an appropriate search algorithm is very useful. Platform: |
Size: 83968 |
Author:quanyecha |
Hits:
Description: 为了提高算法的执行效率, 应用粒子群算法求取图像中任意两点间最短路径来定位目标边界, 并与经典的基于Dijkstra 动态规划图搜索的Liv e Wire 算法进行比较.-In order to improve the efficiency of the algorithm, particle swarm algorithm to strike any of images to locate the shortest path between two object boundaries, and with the classical dynamic programming graph search based on Dijkstra' s algorithm to compare Liv e Wire. Platform: |
Size: 318464 |
Author:莉 |
Hits:
Description: 本算法是基于图论的广度优先搜索算法，对于配电网的孤岛搜索，以及各个孤岛的电气连通性判别具有很好的效果。-Used to solve the problem about graph search algorithm.
Platform: |
Size: 21504 |
Author:陆亚南 |
Hits:
Search - graph search algorithm